One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information

نویسندگان

چکیده

This paper studies an information-theoretic one-shot variable-length secret key agreement problem with public discussion. Let X and Y be jointly distributed random variables, each taking values in some measurable space. Alice Bob observe respectively, can communicate interactively through a noiseless channel, want to agree on length that is approximately uniformly over all bit sequences the agreed length. The discussion observed by eavesdropper, Eve. should independent of discussion, conditional We show optimal expected close mutual information I(X;Y) within logarithmic gap. Moreover, upper bound lower written down terms only. means performance always small gap asymptotic regardless distribution pair (X,Y). result may find applications situations where components i.i.d. source (X n ,Y ) are sequentially output bit, or not ergodic process.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information per Bit

The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components in order to generate a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy o...

متن کامل

Unconditionally Secure Secret-key Agreement and the Intrinsic Conditional Mutual Information

This paper is concerned with secret-key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but au...

متن کامل

Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible

This paper is concerned with information-theoretically secure secret key agreement in the general scenario where three parties,quence of random bits broadcast by a satellite. We consider the problem of determining for a given distribution PXY Z whether Alice and Bob can in principle, by communicating over an insecure channel accessible to Eve, generate a secret key about which Eve's information...

متن کامل

Secret key agreement by public discussion from common information

The problem of generating a shared secret key S by two parties knowing dependent random variables X and I’, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable 2, jointly distributed with X and Y according to some probability distribution PXYZ, can also receive all messages exchanged by the two parties over a public channel. The goal of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2021

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3087963